Techniques for Inverted Index Compression

The data structure at the core of large-scale search engines is inverted index, which essentially a collection sorted integer sequences called lists. Because many documents indexed by such and stringent performance requirements imposed heavy load queries, index stores billions integers that must be searched efficiently. In this scenario, compression essential because it leads to better exploitation computer memory hierarchy for faster query processing and, same time, allows reducing number storage machines. aim article twofold: first, surveying encoding algorithms suitable second, characterizing through experimentation.